翻訳と辞書 Words near each other ・ Graph Nobel ・ Graph of a function ・ Graph of desire ・ Graph of groups ・ Graph operations ・ Graph paper ・ Graph partition ・ Graph pax ・ Graph pebbling ・ Graph power ・ Graph product ・ Graph property ・ Graph realization problem ・ Graph reduction ・ Graph reduction machine ・ Graph rewriting ・ Graph sandwich problem ・ Graph state ・ Graph structure theorem ・ Graph Style Sheets ・ Graph theory ・ Graph theory in enzymatic kinetics ・ Graph toughness ・ Graph traversal ・ Graph-based access control ・ GRaPH-Int ・ Graph-structured stack ・ Graph-tool ・ Graph500 ・ Graphalloy Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Graph rewriting ： ウィキペディア英語版 Graph rewriting Graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation. Graph transformations can be used as a computation abstraction. The basic idea is that the state of a computation can be represented as a graph, further steps in that computation can then be represented as transformation rules on that graph. Such rules consist of an original graph, which is to be matched to a subgraph in the complete state, and a replacing graph, which will replace the matched subgraph. Formally, a graph rewriting system usually consists of a set of graph rewrite rules of the form $L\; \backslash rightarrow\; R$, with $L$ being called pattern graph (or left-hand side) and $R$ being called replacement graph (or right-hand side of the rule). A graph rewrite rule is applied to the host graph by searching for an occurrence of the pattern graph (pattern matching, thus solving the subgraph isomorphism problem) and by replacing the found occurrence by an instance of the replacement graph. Rewrite rules can be further regulated in the case of labeled graphs, such as in string-regulated graph grammars. Sometimes graph grammar is used as a synonym for graph rewriting system, especially in the context of formal languages; the different wording is used to emphasize the goal of constructions, like the enumeration of all graphs from some starting graph, i.e. the generation of a graph language – instead of simply transforming a given state (host graph) into a new state. ==Graph rewriting approaches== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Graph rewriting」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.